- applicative-order evaluation
- Программирование: аппликативный порядок вычислений
Универсальный англо-русский словарь. Академик.ру. 2011.
applicative-order evaluation
Смотреть что такое "applicative-order evaluation" в других словарях:
Evaluation strategy — Evaluation strategies Strict evaluation Applicative order Call by value Call by reference Call by sharing Call by copy restore Non strict evaluation Normal order Call by name Call by need/Lazy evaluation … Wikipedia
Short-circuit evaluation — Evaluation strategies Strict evaluation Applicative order Call by value Call by reference Call by sharing Call by copy restore Non strict evaluation Normal order Call by name Call by need/Lazy evaluation Call by … Wikipedia
Normal Order Reduction — Die Normal Order Reduction (NOR) ist eine Ableitungsstrategie beim Lambda Kalkül, um einen Lambda Ausdruck zu dessen Normalform abzuleiten. Bei dieser Strategie wird die lazy evaluation genutzt, bei der die Ausdrücke erst ausgewertet werden, wenn … Deutsch Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Fixed-point combinator — Y combinator redirects here. For the technology venture capital firm, see Y Combinator (company). In computer science, a fixed point combinator (or fixpoint combinator[1] ) is a higher order function that computes a fixed point of other functions … Wikipedia
Fixed point combinator — A fixed point combinator (or fixed point operator) is a higher order function that computes a fixed point of other functions. This operation is relevant in programming language theory because it allows the implementation of recursion in the form… … Wikipedia
Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… … Wikipedia
Beta normal form — In the lambda calculus, a term is in beta normal form if no beta reduction is possible. A term is in beta eta normal form if neither a beta reduction nor an eta reduction is possible. A term is in head normal form if there is no beta redex in… … Wikipedia
Lisp (programming language) — Infobox programming language name = Lisp paradigm = multi paradigm: functional, procedural, reflective generation = 3GL year = 1958 designer = John McCarthy developer = Steve Russell, Timothy P. Hart, and Mike Levin latest release version =… … Wikipedia
Functional programming — In computer science, functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids state and mutable data. It emphasizes the application of functions, in contrast with the… … Wikipedia
Monad (functional programming) — In functional programming, a monad is a programming structure that represents computations. Monads are a kind of abstract data type constructor that encapsulate program logic instead of data in the domain model. A defined monad allows the… … Wikipedia
